Learning locally minimax optimal Bayesian networks
نویسندگان
چکیده
منابع مشابه
Learning locally minimax optimal Bayesian networks
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background knowledge is available. The problem can be divided into two different subtasks: learning the structure of the network (a set of independence relations), and learning the parameters of the model (that fix the probability ...
متن کاملLocally Minimax Optimal Predictive Modeling with Bayesian Networks
We propose an information-theoretic approach for predictive modeling with Bayesian networks. Our approach is based on the minimax optimal Normalized Maximum Likelihood (NML) distribution, motivated by the MDL principle. In particular, we present a parameter learning method which, together with a previously introduced NML-based model selection criterion, provides a way to construct highly predic...
متن کاملMinimax Optimal Procedures for Locally Private Estimation
Working under a model of privacy in which data remains private even from the statistician,we study the tradeoff between privacy guarantees and the risk of the resulting statistical estima-tors. We develop private versions of classical information-theoretic bounds, in particular thosedue to Le Cam, Fano, and Assouad. These inequalities allow for a precise characterization ofs...
متن کاملLocally Bayesian Learning
This article is concerned with trial-by-trial, online learning of cue-outcome mappings. In models structured as successions of component functions, an external target can be backpropagated such that the lower layer’s target is the input to the higher layer that maximizes the probability of the higher layer’s target. Each layer then does locally Bayesian learning. The resulting parameter updatin...
متن کاملLearning Optimal Bayesian Networks Using A* Search
This paper formulates learning optimal Bayesian network as a shortest path finding problem. An A* search algorithm is introduced to solve the problem. With the guidance of a consistent heuristic, the algorithm learns an optimal Bayesian network by only searching the most promising parts of the solution space. Empirical results show that the A* search algorithm significantly improves the time an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2010
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2010.01.012